Solving Cargo Loading Problem Using Simulated Annealing Technique
نویسندگان
چکیده
منابع مشابه
Solving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...
متن کاملSolving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملSolving the Assignment Problem using Genetic Algorithm and Simulated Annealing
The paper attempts to solve the generalized “Assignment problem” through genetic algorithm and simulated annealing. The generalized assignment problem is basically the “N menN jobs” problem where a single job can be assigned to only one person in such a way that the overall cost of assignment is minimized. While solving this problem through genetic algorithm (GA), a unique encoding scheme is us...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Science & Technoledge
سال: 2020
ISSN: 2321-919X
DOI: 10.24940/theijst/2020/v8/i7/st2007-017